An Average Case NP-complete Graph Problem
نویسندگان
چکیده
NP-complete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under any samplable (i.e. generateable in polynomial time) distribution are easy.
منابع مشابه
An Average Case NP-Complete Graph Coloring Problem
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on average unless all NP problem under all samplable (i.e., generatable in polynomial time) distributions ...
متن کاملMining for trees in a graph is NP-complete
Of course, the even more general problem where the pattern is a graph is already well-known to be NP-complete, as it contains the well-known NP-complete Subgraph Isomorphism problem as the special case k = 1. We thus see here that restricting to tree patterns does not lower the worst-case complexity. The NP-completeness of Disjoint Occurrences of T3 follows immediately from the NP-completeness ...
متن کاملOn Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy collapses to the third level. Feigenbaum and Fortnow (SICOMP 22:994-1005, 1993) show the same conclusion under the stronger assumption that an NP-complete problem has a non-adaptive random self-reduction. Our result show...
متن کاملAnother Measure for the Lexicographically First Maximal Subgraph Problems and Its Threshold Value on a Random Graph
We investigate structural parameters of a graph that express the boundary of the parallel complexity of the lexicographically rst maximal independent set (LFMIS) problem. The longest directed path length (LDPL), which is introduced in the paper, is a better measure than previously known one. The parallel complexity of the LFMIS problem on a graph gradually increases as the value measured on the...
متن کاملContents 1 Average - Case Computational Complexity Theory 1
NP-complete problems are generally thought of as being com-putationally intractable. However, NP-completeness is a worst-case concept. Indeed, some NP-complete problems are \easy on average," though some may not be. How is one to know whether an NP-complete problem is \diicult on average"? The theory of average-case computational complexity , initiated by Levin about ten years ago, is devoted t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CC/0112001 شماره
صفحات -
تاریخ انتشار 2001